Optimizing Database Accesses for Parallel Processing of Multikey Range Searches
نویسندگان
چکیده
منابع مشابه
Optimizing Database Accesses for Parallel Processing of Multikey Range Searches
A multikey search query has many qualified records because it specifies some of the attributes and the rest of them are unspecified. Thus, data distribution among the parallel devices is important to enhance access concurrency for multikey search queries. Though there are some heuristics on data distribution for multikey accesses, range specification in a query has not been considered in those ...
متن کاملSix-fold speed-up of Smith-Waterman sequence database searches using parallel processing on common microprocessors
MOTIVATION Sequence database searching is among the most important and challenging tasks in bioinformatics. The ultimate choice of sequence-search algorithm is that of Smith-Waterman. However, because of the computationally demanding nature of this method, heuristic programs or special-purpose hardware alternatives have been developed. Increased speed has been obtained at the cost of reduced se...
متن کاملA Parallel Multikey Quicksort Algorithm for Mining Multiword Units
In the context of word associations, multiword units (sequences of words that co-occur more often than expected by chance) are frequently used in everyday language, usually to precisely express ideas and concepts that cannot be compressed into a single word. For instance, [Bill of Rights], [swimming pool], [as well as], [in order to], [to comply with] or [to put forward] are multiword units. As...
متن کاملOptimizing Multi Storage Parallel Backup for Real Time Database Systems
Real time databases are processing millions and billions of records on daily basis. Processing and taking backups of those real time databases are highly expensive. Traditional backup methods are progressively more difficult to back up huge volume of data’s. To overcome this issue, in previous work we addressed the difficulties of the issues and provided a solution for compressing the real time...
متن کاملOptimizing persistent random searches.
We consider a minimal model of persistent random searcher with a short range memory. We calculate exactly for such a searcher the mean first-passage time to a target in a bounded domain and find that it admits a nontrivial minimum as function of the persistence length. This reveals an optimal search strategy which differs markedly from the simple ballistic motion obtained in the case of Poisson...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1992
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/35.1.45